منابع مشابه
Effective compression algorithms for pulsed thermography data
Two compression algorithms for the image sequences generated by pulsed-transient thermography for non-destructive testing were developed. The first algorithm allows to balance the quality of the original measurement data reproduction against the compression ratio. This algorithm comprises a dedicated space/time mapping (STM) method and an image compression algorithm (JPEG2000). The second algor...
متن کاملEffective Steganography Detection Based On Data Compression
(The main idea: The compression used for stegotext detection. It is known that an embedding message breaks statistical structure of the container, increasing its entropy. Consequently, the full container will compress worse than empty. Let us consider the example: A, B empty and full container respectively. Table 1: Container size before and after compression container.. container size before c...
متن کاملOptimal learning via local entropies and sample compression
Under margin assumptions, we prove several risk bounds, represented via the distribution depen-dent local entropies of the classes or the sizes of specific sample compression schemes. In somecases, our guarantees are optimal up to constant factors for families of classes. We discuss limi-tations of our approach and give several applications. In particular, we provide a new tight...
متن کاملHow Effective are Compression Codes for Reducing Test Data Volume?
Run-length codes and their variants have recently been shown to be very effective for compressing system-on-achip (SOC) test data. In this paper, we analyze the Golomb code, the conventional run-length code and the FDR code for a binary memoryless data source, and compare the compression obtained in each case to fundamental entropy bounds. We show analytically that the FDR code outperforms both...
متن کاملAn Effective Grammar-Based Compression Algorithm for Tree Structured Data
Many semistructured data such as HTML/XML files are represented by rooted trees t such that all children of each internal vertex of t are ordered and all edges of t have labels. Such data is called tree structured data. Analyzing large tree structured data is a time-consuming process in data mining. If we can reduce the size of input data without loss of information, we can speed up such a heav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90060-f